0.00/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n024.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Thu Jul 4 10:45:53 EDT 2024 0.12/0.33 % CPUTime : 0.19/0.47 Running higher-order theorem proving 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.I7U3AjeADn/E---3.1_21545.p 4.18/1.19 # Version: 3.2.0-ho 4.18/1.19 # Preprocessing class: HSMSSMSSSSSNSSA. 4.18/1.19 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 4.18/1.19 # Starting post_as_ho1 with 900s (5) cores 4.18/1.19 # Starting post_as_ho12 with 180s (1) cores 4.18/1.19 # Starting new_ho_3 with 180s (1) cores 4.18/1.19 # Starting ehoh_best2_full_lfho with 180s (1) cores 4.18/1.19 # post_as_ho12 with pid 21624 completed with status 0 4.18/1.19 # Result found by post_as_ho12 4.18/1.19 # Preprocessing class: HSMSSMSSSSSNSSA. 4.18/1.19 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 4.18/1.19 # Starting post_as_ho1 with 900s (5) cores 4.18/1.19 # Starting post_as_ho12 with 180s (1) cores 4.18/1.19 # No SInE strategy applied 4.18/1.19 # Search class: HGUSF-FFMF21-SSSFFMBN 4.18/1.19 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 4.18/1.19 # Starting ehoh_best2_full_lfho with 93s (1) cores 4.18/1.19 # ehoh_best2_full_lfho with pid 21628 completed with status 0 4.18/1.19 # Result found by ehoh_best2_full_lfho 4.18/1.19 # Preprocessing class: HSMSSMSSSSSNSSA. 4.18/1.19 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 4.18/1.19 # Starting post_as_ho1 with 900s (5) cores 4.18/1.19 # Starting post_as_ho12 with 180s (1) cores 4.18/1.19 # No SInE strategy applied 4.18/1.19 # Search class: HGUSF-FFMF21-SSSFFMBN 4.18/1.19 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 4.18/1.19 # Starting ehoh_best2_full_lfho with 93s (1) cores 4.18/1.19 # Preprocessing time : 0.001 s 4.18/1.19 4.18/1.19 # Proof found! 4.18/1.19 # SZS status Theorem 4.18/1.19 # SZS output start CNFRefutation 4.18/1.19 thf(decl_sort1, type, a: $tType). 4.18/1.19 thf(decl_22, type, c0: a). 4.18/1.19 thf(decl_23, type, x: a). 4.18/1.19 thf(decl_24, type, cP: a > a > a). 4.18/1.19 thf(decl_25, type, esk1_1: (a > a > a > $o) > a). 4.18/1.19 thf(decl_26, type, esk2_1: (a > a > a > $o) > a). 4.18/1.19 thf(decl_27, type, esk3_1: (a > a > a > $o) > a). 4.18/1.19 thf(decl_28, type, esk4_1: (a > a > a > $o) > a). 4.18/1.19 thf(decl_29, type, esk5_1: (a > a > a > $o) > a). 4.18/1.19 thf(decl_30, type, esk6_1: (a > a > a > $o) > a). 4.18/1.19 thf(decl_31, type, esk7_1: (a > a > a > $o) > a). 4.18/1.19 thf(decl_32, type, esk8_1: (a > a > a > $o) > a). 4.18/1.19 thf(decl_33, type, esk9_1: (a > a > a > $o) > a). 4.18/1.19 thf(cS_INCL_LEM6_pme, conjecture, ((![X1:a, X2:a, X3:a, X4:a]:((((cP @ X1 @ X3)=(cP @ X2 @ X4))=>(((X1)=(X2))&((X3)=(X4)))))&![X1:a, X2:a]:(((cP @ X1 @ X2)!=(c0))))=>(![X5:a > a > a > $o]:(((![X6:a, X7:a, X8:a]:(((X5 @ X6 @ X7 @ X8)<=((((X6)=(c0))&((X7)=(X8)))|?[X9:a, X10:a, X11:a, X12:a, X13:a, X14:a]:(((((((X6)=(cP @ X9 @ X10))&((X7)=(cP @ X11 @ X12)))&(X5 @ X9 @ X11 @ X13))&(X5 @ X10 @ X12 @ X14))&((X8)=(cP @ X13 @ X14))))|(((X6)=(X8))&((X7)=(c0))))))&($true))=>(X5 @ x @ c0 @ c0)))=>((x)=(c0)))), file('/export/starexec/sandbox/tmp/tmp.I7U3AjeADn/E---3.1_21545.p', cS_INCL_LEM6_pme)). 4.18/1.19 thf(c_0_1, negated_conjecture, ~(((![X1:a, X2:a, X3:a, X4:a]:((((cP @ X1 @ X3)=(cP @ X2 @ X4))=>(((X1)=(X2))&((X3)=(X4)))))&![X1:a, X2:a]:(((cP @ X1 @ X2)!=(c0))))=>(![X5:a > a > a > $o]:(((![X6:a, X7:a, X8:a]:((((((X6)=(c0))&((X7)=(X8)))|?[X9:a, X10:a, X11:a, X12:a, X13:a, X14:a]:(((((((X6)=(cP @ X9 @ X10))&((X7)=(cP @ X11 @ X12)))&(X5 @ X9 @ X11 @ X13))&(X5 @ X10 @ X12 @ X14))&((X8)=(cP @ X13 @ X14))))|(((X6)=(X8))&((X7)=(c0))))=>(X5 @ X6 @ X7 @ X8)))&$true)=>(X5 @ x @ c0 @ c0)))=>((x)=(c0))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cS_INCL_LEM6_pme])])). 4.18/1.19 thf(c_0_2, negated_conjecture, ![X31:a, X32:a, X33:a, X34:a, X35:a, X36:a, X37:a > a > a > $o]:(((((((X31)=(X32))|((cP @ X31 @ X33)!=(cP @ X32 @ X34)))&(((X33)=(X34))|((cP @ X31 @ X33)!=(cP @ X32 @ X34))))&((cP @ X35 @ X36)!=(c0)))&(((((((((((esk1_1 @ X37)=(esk3_1 @ X37))|(((esk1_1 @ X37)=(cP @ (esk4_1 @ X37) @ (esk5_1 @ X37)))|((esk1_1 @ X37)=(c0)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk2_1 @ X37)=(c0))|(((esk1_1 @ X37)=(cP @ (esk4_1 @ X37) @ (esk5_1 @ X37)))|((esk1_1 @ X37)=(c0)))|~($true)|(X37 @ x @ c0 @ c0)))&((((esk1_1 @ X37)=(esk3_1 @ X37))|(((esk2_1 @ X37)=(cP @ (esk6_1 @ X37) @ (esk7_1 @ X37)))|((esk1_1 @ X37)=(c0)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk2_1 @ X37)=(c0))|(((esk2_1 @ X37)=(cP @ (esk6_1 @ X37) @ (esk7_1 @ X37)))|((esk1_1 @ X37)=(c0)))|~($true)|(X37 @ x @ c0 @ c0))))&((((esk1_1 @ X37)=(esk3_1 @ X37))|((X37 @ (esk4_1 @ X37) @ (esk6_1 @ X37) @ (esk8_1 @ X37))|((esk1_1 @ X37)=(c0)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk2_1 @ X37)=(c0))|((X37 @ (esk4_1 @ X37) @ (esk6_1 @ X37) @ (esk8_1 @ X37))|((esk1_1 @ X37)=(c0)))|~($true)|(X37 @ x @ c0 @ c0))))&((((esk1_1 @ X37)=(esk3_1 @ X37))|((X37 @ (esk5_1 @ X37) @ (esk7_1 @ X37) @ (esk9_1 @ X37))|((esk1_1 @ X37)=(c0)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk2_1 @ X37)=(c0))|((X37 @ (esk5_1 @ X37) @ (esk7_1 @ X37) @ (esk9_1 @ X37))|((esk1_1 @ X37)=(c0)))|~($true)|(X37 @ x @ c0 @ c0))))&((((esk1_1 @ X37)=(esk3_1 @ X37))|(((esk3_1 @ X37)=(cP @ (esk8_1 @ X37) @ (esk9_1 @ X37)))|((esk1_1 @ X37)=(c0)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk2_1 @ X37)=(c0))|(((esk3_1 @ X37)=(cP @ (esk8_1 @ X37) @ (esk9_1 @ X37)))|((esk1_1 @ X37)=(c0)))|~($true)|(X37 @ x @ c0 @ c0))))&((((((((esk1_1 @ X37)=(esk3_1 @ X37))|(((esk1_1 @ X37)=(cP @ (esk4_1 @ X37) @ (esk5_1 @ X37)))|((esk2_1 @ X37)=(esk3_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk2_1 @ X37)=(c0))|(((esk1_1 @ X37)=(cP @ (esk4_1 @ X37) @ (esk5_1 @ X37)))|((esk2_1 @ X37)=(esk3_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0)))&((((esk1_1 @ X37)=(esk3_1 @ X37))|(((esk2_1 @ X37)=(cP @ (esk6_1 @ X37) @ (esk7_1 @ X37)))|((esk2_1 @ X37)=(esk3_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk2_1 @ X37)=(c0))|(((esk2_1 @ X37)=(cP @ (esk6_1 @ X37) @ (esk7_1 @ X37)))|((esk2_1 @ X37)=(esk3_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0))))&((((esk1_1 @ X37)=(esk3_1 @ X37))|((X37 @ (esk4_1 @ X37) @ (esk6_1 @ X37) @ (esk8_1 @ X37))|((esk2_1 @ X37)=(esk3_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk2_1 @ X37)=(c0))|((X37 @ (esk4_1 @ X37) @ (esk6_1 @ X37) @ (esk8_1 @ X37))|((esk2_1 @ X37)=(esk3_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0))))&((((esk1_1 @ X37)=(esk3_1 @ X37))|((X37 @ (esk5_1 @ X37) @ (esk7_1 @ X37) @ (esk9_1 @ X37))|((esk2_1 @ X37)=(esk3_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk2_1 @ X37)=(c0))|((X37 @ (esk5_1 @ X37) @ (esk7_1 @ X37) @ (esk9_1 @ X37))|((esk2_1 @ X37)=(esk3_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0))))&((((esk1_1 @ X37)=(esk3_1 @ X37))|(((esk3_1 @ X37)=(cP @ (esk8_1 @ X37) @ (esk9_1 @ X37)))|((esk2_1 @ X37)=(esk3_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0))&(((esk2_1 @ X37)=(c0))|(((esk3_1 @ X37)=(cP @ (esk8_1 @ X37) @ (esk9_1 @ X37)))|((esk2_1 @ X37)=(esk3_1 @ X37)))|~($true)|(X37 @ x @ c0 @ c0)))))&(~(X37 @ (esk1_1 @ X37) @ (esk2_1 @ X37) @ (esk3_1 @ X37))|~($true)|(X37 @ x @ c0 @ c0)))&((x)!=(c0))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 4.18/1.19 thf(c_0_3, negated_conjecture, ![X5:a > a > a > $o]:(((X5 @ x @ c0 @ c0)|~((X5 @ (esk1_1 @ X5) @ (esk2_1 @ X5) @ (esk3_1 @ X5)))|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_2])). 4.18/1.19 thf(c_0_4, negated_conjecture, ![X5:a > a > a > $o]:(((X5 @ x @ c0 @ c0)|~((X5 @ (esk1_1 @ X5) @ (esk2_1 @ X5) @ (esk3_1 @ X5))))), inference(cn,[status(thm)],[c_0_3])). 4.18/1.19 thf(c_0_5, negated_conjecture, ![X5:a > a > a > $o]:((((esk1_1 @ X5)=(esk3_1 @ X5))|((esk3_1 @ X5)=(cP @ (esk8_1 @ X5) @ (esk9_1 @ X5)))|((esk1_1 @ X5)=(c0))|(X5 @ x @ c0 @ c0)|~(($true)))), inference(split_conjunct,[status(thm)],[c_0_2])). 4.18/1.19 thf(c_0_6, negated_conjecture, ![X51:a > a > a > $o, X50:a > a > a > $o]:(((X51 @ x @ c0 @ c0)|(X50 @ x @ c0 @ c0)|~(((X51 @ (esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X51 @ Z0 @ Z1 @ Z2)|(X50 @ Z0 @ Z1 @ Z2))))) @ (esk2_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X51 @ Z0 @ Z1 @ Z2)|(X50 @ Z0 @ Z1 @ Z2))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X51 @ Z0 @ Z1 @ Z2)|(X50 @ Z0 @ Z1 @ Z2))))))|(X50 @ (esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X51 @ Z0 @ Z1 @ Z2)|(X50 @ Z0 @ Z1 @ Z2))))) @ (esk2_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X51 @ Z0 @ Z1 @ Z2)|(X50 @ Z0 @ Z1 @ Z2))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X51 @ Z0 @ Z1 @ Z2)|(X50 @ Z0 @ Z1 @ Z2)))))))))), inference(primitive_enumeration,[status(thm)],[c_0_4])). 4.18/1.19 thf(c_0_7, negated_conjecture, ![X1:a, X2:a]:(((cP @ X1 @ X2)!=(c0))), inference(split_conjunct,[status(thm)],[c_0_2])). 4.18/1.19 thf(c_0_8, negated_conjecture, ![X5:a > a > a > $o]:((((esk1_1 @ X5)=(c0))|((esk3_1 @ X5)=(esk1_1 @ X5))|((esk3_1 @ X5)=(cP @ (esk8_1 @ X5) @ (esk9_1 @ X5)))|(X5 @ x @ c0 @ c0))), inference(cn,[status(thm)],[c_0_5])). 4.18/1.19 thf(c_0_9, negated_conjecture, ![X21:a > a > a > $o, X5:a > a > a > $o]:(((X5 @ x @ c0 @ c0)|(X21 @ x @ c0 @ c0)|~((X5 @ (esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X21 @ Z0 @ Z1 @ Z2)|(X5 @ Z0 @ Z1 @ Z2))))) @ (esk2_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X21 @ Z0 @ Z1 @ Z2)|(X5 @ Z0 @ Z1 @ Z2))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X21 @ Z0 @ Z1 @ Z2)|(X5 @ Z0 @ Z1 @ Z2))))))))), inference(dynamic_cnf,[status(thm)],[c_0_6])). 4.18/1.19 thf(c_0_10, negated_conjecture, ![X5:a > a > a > $o]:((((esk3_1 @ X5)=(esk1_1 @ X5))|((esk1_1 @ X5)=(c0))|(X5 @ x @ c0 @ c0)|((esk3_1 @ X5)!=(c0)))), inference(spm,[status(thm)],[c_0_7, c_0_8])). 4.18/1.19 thf(c_0_11, negated_conjecture, ![X5:a > a > a > $o]:((((esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0))))))=(c0))|(X5 @ x @ c0 @ c0))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_9])). 4.18/1.19 thf(c_0_12, negated_conjecture, ![X5:a > a > a > $o]:((((esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0))))))=(c0))|(X5 @ x @ c0 @ c0))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11])])])). 4.18/1.19 thf(c_0_13, negated_conjecture, ![X5:a > a > a > $o]:(((X5 @ x @ c0 @ c0)|~(((X5 @ c0 @ (esk2_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0)))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0)))))))|((esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0))))))!=(c0)))))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_4, c_0_12])])])). 4.18/1.19 thf(c_0_14, negated_conjecture, ![X5:a > a > a > $o]:((((esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0))))))=(c0))|(X5 @ x @ c0 @ c0))), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_13])])). 4.18/1.19 thf(c_0_15, negated_conjecture, ![X21:a > a > a > $o, X5:a > a > a > $o]:(((X5 @ x @ c0 @ c0)|(X21 @ x @ c0 @ c0)|~((X21 @ (esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X21 @ Z0 @ Z1 @ Z2)|(X5 @ Z0 @ Z1 @ Z2))))) @ (esk2_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X21 @ Z0 @ Z1 @ Z2)|(X5 @ Z0 @ Z1 @ Z2))))) @ (esk3_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X21 @ Z0 @ Z1 @ Z2)|(X5 @ Z0 @ Z1 @ Z2))))))))), inference(dynamic_cnf,[status(thm)],[c_0_6])). 4.18/1.19 thf(c_0_16, negated_conjecture, ![X5:a > a > a > $o]:((((esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:(((X5 @ Z0 @ Z1 @ Z2)|((Z2)!=(c0))))))=(c0))|(X5 @ x @ c0 @ c0))), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_14])])])). 4.18/1.19 thf(c_0_17, negated_conjecture, ![X5:a > a > a > $o]:((((esk1_1 @ (^[Z0/* 19 */:a, Z1:a, Z2:a]:((((Z0)!=(x))|(X5 @ Z0 @ Z1 @ Z2)))))=(x))|(X5 @ x @ c0 @ c0))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_15])). 4.18/1.19 thf(c_0_18, negated_conjecture, ((x)!=(c0)), inference(split_conjunct,[status(thm)],[c_0_2])). 4.18/1.19 thf(c_0_19, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17])])]), c_0_18]), ['proof']). 4.18/1.19 # SZS output end CNFRefutation 4.18/1.19 # Parsed axioms : 5 4.18/1.19 # Removed by relevancy pruning/SinE : 0 4.18/1.19 # Initial clauses : 29 4.18/1.19 # Removed in clause preprocessing : 4 4.18/1.19 # Initial clauses in saturation : 25 4.18/1.19 # Processed clauses : 2284 4.18/1.19 # ...of these trivial : 3 4.18/1.19 # ...subsumed : 1004 4.18/1.19 # ...remaining for further processing : 1277 4.18/1.19 # Other redundant clauses eliminated : 0 4.18/1.19 # Clauses deleted for lack of memory : 0 4.18/1.19 # Backward-subsumed : 107 4.18/1.19 # Backward-rewritten : 0 4.18/1.19 # Generated clauses : 12454 4.18/1.19 # ...of the previous two non-redundant : 11329 4.18/1.19 # ...aggressively subsumed : 0 4.18/1.19 # Contextual simplify-reflections : 0 4.18/1.19 # Paramodulations : 4924 4.18/1.19 # Factorizations : 3 4.18/1.19 # NegExts : 530 4.18/1.19 # Equation resolutions : 101 4.18/1.19 # Disequality decompositions : 0 4.18/1.19 # Total rewrite steps : 1230 4.18/1.19 # ...of those cached : 1225 4.18/1.19 # Propositional unsat checks : 0 4.18/1.19 # Propositional check models : 0 4.18/1.19 # Propositional check unsatisfiable : 0 4.18/1.19 # Propositional clauses : 0 4.18/1.19 # Propositional clauses after purity: 0 4.18/1.19 # Propositional unsat core size : 0 4.18/1.19 # Propositional preprocessing time : 0.000 4.18/1.19 # Propositional encoding time : 0.000 4.18/1.19 # Propositional solver time : 0.000 4.18/1.19 # Success case prop preproc time : 0.000 4.18/1.19 # Success case prop encoding time : 0.000 4.18/1.19 # Success case prop solver time : 0.000 4.18/1.19 # Current number of processed clauses : 989 4.18/1.19 # Positive orientable unit clauses : 8 4.18/1.19 # Positive unorientable unit clauses: 0 4.18/1.19 # Negative unit clauses : 2 4.18/1.19 # Non-unit-clauses : 979 4.18/1.19 # Current number of unprocessed clauses: 8692 4.18/1.19 # ...number of literals in the above : 63447 4.18/1.19 # Current number of archived formulas : 0 4.18/1.19 # Current number of archived clauses : 288 4.18/1.19 # Clause-clause subsumption calls (NU) : 114478 4.18/1.19 # Rec. Clause-clause subsumption calls : 10195 4.18/1.19 # Non-unit clause-clause subsumptions : 1046 4.18/1.19 # Unit Clause-clause subsumption calls : 156 4.18/1.19 # Rewrite failures with RHS unbound : 0 4.18/1.19 # BW rewrite match attempts : 5 4.18/1.19 # BW rewrite match successes : 3 4.18/1.19 # Condensation attempts : 0 4.18/1.19 # Condensation successes : 0 4.18/1.19 # Termbank termtop insertions : 963247 4.18/1.19 # Search garbage collected termcells : 588 4.18/1.19 4.18/1.19 # ------------------------------------------------- 4.18/1.19 # User time : 0.689 s 4.18/1.19 # System time : 0.016 s 4.18/1.19 # Total time : 0.705 s 4.18/1.19 # Maximum resident set size: 1896 pages 4.18/1.19 4.18/1.19 # ------------------------------------------------- 4.18/1.19 # User time : 0.692 s 4.18/1.19 # System time : 0.016 s 4.18/1.19 # Total time : 0.709 s 4.18/1.19 # Maximum resident set size: 1724 pages 4.18/1.19 % E---3.1 exiting 4.18/1.20 % E exiting 4.18/1.20 EOF